CS146Spring 2014Lecture Notes
Data Structures and Algorithms
Videos of lectures are available. As
they are on my office machine and I don't want robots to try to download them, the
directory is password protected. The login is guest and the password is guest.
Below are my lecture notes for the class so far.
They should serve as a rough guide to what was covered on any given day.
Frequently, however, I say more in class than is in these notes.
Also, I tend to dynamically correct typos on the board
that might appear in these lecture notes. So caveat emptor.
Week 1: [Jan. 27 -- The Role of Algorithms in Computing] [Jan. 29 -- Algorithms as a Technology]
Week 2: [Feb 3 -- Insertion Sort] [Feb 5 -- Designing and Analyzing Algorithms]
Week 3: [Feb 10 -- Mergesort, Recurrences] [Feb 12 -- Asymptotics]
Week 4: [Feb 17 -- Common Functions, Recurrences] [Feb 19 -- Divide and Conquer Recurrences]
Week 5: [Feb 24 -- Finish Recurrences, Heaps] [Feb 26 -- Heapsort, Priority Queues]
Week 6: [Mar 3 -- Quicksort][Mar 5 -- Quicksort Analysis, Start Linear Time Search]
Week 7: [Mar 10 -- Linear Time Search] [Mar 12 -- Bucket Sort, Selection]
Week 8: [Mar 17 -- Practice Midterm Day] [Mar 19 -- Midterm Day]
Week 9: [Mar 24 -- Spring Break] [Mar 26 -- Spring Break]
Week 10: [Mar 31 --Cesar Chavez Day] [Apr 2 -- Elementary Data Structures]
Week 11: [Apr 7 -- Binary Search Trees] [Apr 9 -- Binary Search Tree Operations]
Week 12: [Apr 14 -- Red Black Trees] [Apr 16 -- Red Black Tree Operations]
Week 13: [Apr 21 -- Finish Red Black Trees, Dynamic Programming] [Apr 23 -- Finish Rod-cutting, Start LCS]
Week 14: [Apr 28 -- Finish LCS, Greedy Algorithms] [Apr 30 -- Finish Activity-Selector, Graph Algorithms]
Week 15: [May 5 -- Depth First Search, Topological Sort, MST's] [May 7 -- MST's and NP-completeness]
|